Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
نویسندگان
چکیده
منابع مشابه
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
We present and analyse Las Vegas distributed algorithms which compute a MIS or a maximal matching for anonymous rings. Their bit complexity and time complexity are O( √ logn) with high probability. These algorithms are optimal modulo a multiplicative constant. Beyond the complexity results, the interest of this work stands in the description and the analysis of these algorithms which may be eas...
متن کاملOn the time and the bit complexity of distributed randomised anonymous ring colouring
We present and analyse a very simple randomised distributed vertex colouring algorithm for ring graphs. Its time complexity is log2 n + o(log n) on average and 2log2 n + o(log n) with probability 1− o(n). Each message containing 1 bit we deduce the same values for its bit complexity. Then we compose this algorithm with another and we obtain a 3-colouring algorithm for ring graphs. Thanks to an ...
متن کاملOptimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, called contenders, determine whether or not there is exactly one contender. Monte Carlo algorithms are developed, that err with probability bounded...
متن کاملSelf-Stabilizing Maximal Matching and Anonymous Networks
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is O(n) moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine whether one of its neighbors points to it or to another node, leading to a contradiction with the anonymous assumption. To solve this problem, we provide under th...
متن کاملThe Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case
The distributed bit complexity of an asynchronous network of processors is a lower bound on the worst case bit complexity of computing any noo-constant function of the inputs to the processors [MW]. This concept attempts to capture the amount of communication required for any "useful" computation on the network. The aim of this kind of research is to characterize networks by their bit complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2013
ISSN: 0890-5401
DOI: 10.1016/j.ic.2013.10.005